Two-Center Problems for a Convex Polygon
نویسندگان
چکیده
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملAn Analytical Solution for Inverse Determination of Residual Stress Field
An analytical solution is presented that reconstructs residual stress field from limited and incomplete data. The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function. This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon. The analytical solu...
متن کاملSolving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کاملApproximation algorithms for the two-center problem of convex polygon
Given a convex polygon P with n vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover P . We propose an algorithm for this problem in the streaming setup, where the input stream is the vertices of the polygon in clockwise order. It produces a radius r satisfying r ≤ 2ropt using O(1) space, where ropt is the optimum solution. Nex...
متن کاملAn improved method for calculating the no-fit polygon
The no-fit polygon (NFP) is the set of feasible locations that one polygon may take with respect to another polygon, such that the polygons do not overlap. Feasible locations are required for most of the solutions to two-dimensional packing problems, and also for other problems such as robot motion planning. Efficient methods to calculate the NFP of two convex polygons, or one convex and one no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998